北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2009, Vol. 32 ›› Issue (1): 99-102.doi: 10.13190/jbupt.200901.99.004

• 研究报告 • 上一篇    下一篇

无条件安全的隐私保护的集合模式匹配协议

郑强 罗守山 辛阳   

  1. 北京邮电大学 北京邮电大学软件学院
  • 收稿日期:2008-07-15 修回日期:1900-01-01 出版日期:2009-01-28 发布日期:2009-01-28
  • 通讯作者: 郑强

Protocol for Privacy preserving Set Pattern Matching with Unconditionally Secure

ZHENG Qiang   

  • Received:2008-07-15 Revised:1900-01-01 Online:2009-01-28 Published:2009-01-28
  • Contact: ZHENG Qiang

摘要:

在信息论通信模型下,基于秘密分享模式和将集合的元素转化为多项式形式的技术,提出了隐私保护的集合模式匹配的协议。假设参与方都是半诚实的,且合谋的参与方人数少于1/2,那么所提的协议能够安全高效的计算集合模式匹配的问题。由于此协议是在信息论模型下所提出的集合模式匹配协议,所以此协议是无条件安全的。

关键词: 安全多方计算, 信息论模型, 模式匹配, 无条件安全

Abstract:

To overcome the inadequate of the existed protocols for privacy preserving set operation that almost comes from homomorphic public-key encryption in the cryptographic model. A protocol for privacy preserving set pattern matching, based on the secret sharing scheme and the technique of representing sets as polynomials, is proposed. Assuming that all players are semi-honest, and less than players collude, the set pattern matching is correctly computed by this protocol. Since the presented protocol is based on information theoretic model, it is unconditionally secure.

Key words: secure multiparty computation, information theoretic model, pattern matching, unconditionally secure